MAD trees and distance-hereditary graphs
نویسندگان
چکیده
For a graph G with weight function w on the vertices, the total distance of G is the sum over all unordered pairs of vertices x and y of w(x)w(y) times the distance between x and y. A MAD tree of G is a spanning tree with minimum total distance. We develop a linear-time algorithm to find a MAD tree of a distancehereditary graph; that is, those graphs where distances are preserved in every connected induced subgraph.
منابع مشابه
On the Laminar Structure of Ptolemaic and Distance Hereditary Graphs
Ptolemaic graphs are graphs that satisfy ptolemaic inequality for any four vertices. The graph class coincides with the intersection of chordal graphs and distance hereditary graphs. The graph class can also be seen as a natural generalization of block graphs (and hence trees). In this paper, a new characterization of ptolemaic graphs is presented. It is a canonical tree representation based on...
متن کاملDistance-Balanced Closure of Some Graphs
In this paper we prove that any distance-balanced graph $G$ with $Delta(G)geq |V(G)|-3$ is regular. Also we define notion of distance-balanced closure of a graph and we find distance-balanced closures of trees $T$ with $Delta(T)geq |V(T)|-3$.
متن کاملWeighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs
Distance-hereditary graphs are graphs in which every two vertices have the same distance in every connected induced subgraph containing them. This paper studies distance-hereditary graphs from an algorithmic viewpoint. In particular, we present linear-time algorithms for finding a minimum weighted connected dominating set and a minimum vertex-weighted Steiner tree in a distance-hereditary graph...
متن کاملLinear-time algorithms for the Hamiltonian problems on distance-hereditary graphs,
In the literature, there are quite a few algorithms to solve problems on distance-hereditary graphs. Two well-known graphs, trees and cographs, both belong to the class of distance-hereditary graphs. In this paper, we present an O(|V | + |E|)-time sequential algorithm to solve the Hamiltonian problem on a distance-hereditary graph G = (V, E). This algorithm is faster than the previous best resu...
متن کاملCanonical Tree Representation of Distance Hereditary Graphs with Applications∗
The class of distance hereditary graphs consists of the isometric graphs. That is, for each pair of vertices, its distance is invariant for any induced path in a distance hereditary graph. In the paper, a canonical tree representation of a distance hereditary graph is proposed. A linear time algorithm for computing the tree representation is also presented. Hence the recognition problem and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 131 شماره
صفحات -
تاریخ انتشار 2003